In Proceedings of IEEE INFOCOM ’ 93 Rate - Controlled Static - Priority Queueing
نویسنده
چکیده
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies they introduce between the queueing delay and the granularity of bandwidth allocation; sorted priority queues are more complex, and may be difficult to implement. The proposed RCSP queueing discipline avoids both time-framing and sorted priority queues; it achieves flexibility in the allocation of delay and bandwidth, as well as simplicity of implementation. The key idea is to separate rate-control and delay-control functions in the design of the server. Applying this separation of functions will result in a class of service disciplines, of which RCSP is an instance.
منابع مشابه
Rate-Controlled Static-Priority Queueing
We propose a new service discipline, called the RateControlled Static-Priority (RCSP) queueing discipline, that can provide throughput, delay, delay jitter, and loss free guarantees in a connection-oriented packet-switching network. Previously proposed solutions are based on either a time-framing strategy, or a sorted priority queue mechanism. Time-framing schemes suffer from the dependencies t...
متن کاملPricing strategies under heterogeneous service requirements - INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societ
This paper analyzes a communication network with heterogeneous customers. We investigate priority queueing as a way to differentiate between these users. Customers join the network as long as their utility (which is a function of the queueing delay) is larger than the price of the service. We focus on the specific situation in which two types of users play a role: one type is delay-sensitive (‘...
متن کاملRecursive Computation of Steady-State Probabilities in Priority Queues
We derive recursive formulas for computing the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. We also discuss the applications of our method to other queueing systems.
متن کاملAn Efficient Priority-Based Dynamic Channel Allocation Strategy for Mobile Cellular Networks
Priority-based dynamic carrier allocation strategies can be classified into three categories: static-priority, dynamicpriority, and hybrid-priority strategies. Strategies based on static priorities do not consider the local carrier reuse conditions, while dynamic-priority strategies do take these conditions into consideration. Intuitively, one would expect dynamic-priority strategies to perform...
متن کاملA Comparative Evaluation of Space Priority Strategies in ATM Networks
Current standards reserve one bit in the ATM cell header to indicate loss priority. When congestion occurs ai a queue lower priority cells can be discarded in order to insure a smaller cell loss rate for higher priority cells. Strategies for determining which cells to discard are termed space priority buffer management schemes. In ihis paper two adjustable space priority schemes are studied, wh...
متن کامل